| 翻訳と辞書 |
| Fortune's algorithm ： ウィキペディア英語版 |
Fortune's algorithm
Fortune's algorithm is a sweep line algorithm for generating a Voronoi diagram from a set of points in a plane using O(''n'' log ''n'') time and O(''n'') space.〔 Section 7.2: Computing the Voronoi Diagram: pp.151–160.〕〔.〕 It was originally published by Steven Fortune in 1986 in his paper "A sweepline algorithm for Voronoi diagrams."〔Steven Fortune. A sweepline algorithm for Voronoi diagrams. ''Proceedings of the second annual symposium on Computational geometry''. Yorktown Heights, New York, United States, pp.313–322. 1986. ISBN 0-89791-194-6. (ACM Digital Library )(SpringerLink )〕
== Algorithm description ==
The algorithm maintains both a sweep line and a ''beach line'', which both move through the plane as the algorithm progresses. The sweep line is a straight line, which we may by convention assume to be vertical and moving left to right across the plane. At any time during the algorithm, the input points left of the sweep line will have been incorporated into the Voronoi diagram, while the points right of the sweep line will not have been considered yet. The beach line is not a line, but a complicated, piecewise curve to the left of the sweep line, composed of pieces of parabolas; it divides the portion of the plane within which the Voronoi diagram can be known, regardless of what other points might be right of the sweep line, from the rest of the plane. For each point left of the sweep line, one can define a parabola of points equidistant from that point and from the sweep line; the beach line is the boundary of the union of these parabolas. As the sweep line progresses, the vertices of the beach line, at which two parabolas cross, trace out the edges of the Voronoi diagram. The beach line progresses by keeping each parabola base exactly half way between the points initially swept over with the sweep line, and the new position of the sweep line.
The algorithm maintains as data structures a binary search tree describing the combinatorial structure of the beach line, and a priority queue listing potential future events that could change the beach line structure. These events include the addition of another parabola to the beach line (when the sweep line crosses another input point) and the removal of a curve from the beach line (when the sweep line becomes tangent to a circle through some three input points whose parabolas form consecutive segments of the beach line). Each such event may be prioritized by the ''x''-coordinate of the sweep line at the point the event occurs. The algorithm itself then consists of repeatedly removing the next event from the priority queue, finding the changes the event causes in the beach line, and updating the data structures.
As there are O(''n'') events to process (each being associated with some feature of the Voronoi diagram) and O(log ''n'') time to process an event (each consisting of a constant number of binary search tree and priority queue operations) the total time is O(''n'' log ''n'').
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Fortune's algorithm」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|